Updatable timed automata
نویسندگان
چکیده
منابع مشابه
Updatable timed automata
We investigate extensions of Alur and Dill’s timed automata, based on the possibility to update the clocks in a more elaborate way than simply reset them to zero. We call these automata updatable timed automata. They form an undecidable class of models, in the sense that emptiness checking is not decidable. However, using an extension of the region graph construction, we exhibit interesting dec...
متن کاملExpressiveness of Updatable Timed Automata
HAL is a multidisciplinary open access archive for the deposit and dissemination of scientific research documents, whether they are published or not. The documents may come from teaching and research institutions in France or abroad, or from public or private research centers. L'archive ouverte pluridisciplinaire HAL, est destinée au dépôt età la diffusion de documents scientifiques de niveau r...
متن کاملForward Analysis of Updatable Timed Automata
Timed automata are a widely studied model. Its decidability has been proved using the so-called region automaton construction. This construction provides a correct abstraction for the behaviours of timed automata, but it suffers from a state explosion and is thus not used in practice. Instead, algorithms based on the notion of zones are implemented using adapted data structures like DBMs. When ...
متن کاملP . Bouyer Updatable Timed Automata , an Algorithmic Approach
The notion of updatable timed automata has been introduced as a natural syntactic extension of classical timed automata. These updatable timed automata allow in particular to represent large classes of real-time systems in a much more concise way. For numerous families of updatable timed automata, the decidability of the emptiness problem has been proved with a suitable extension of Alur and Di...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2004
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2004.04.003